Ill-conditionedness Needs Not Be Componentwise near to Ill-posedness for Least Squares Problems
نویسنده
چکیده
The condition number of a problem measures the sensitivity of the answer to small changes in the input, where “small” refers to some distance measure. A problem is called illconditioned if the condition number is large, and it is called ill-posed if the condition number is infinity. It is known that for many problems the (normwise) distance to the nearest ill-posed problem is proportional to the reciprocal of the condition number. Recently it has been shown that for linear systems and matrix inversion this is also true for componentwise distances. In this note we show that this is no longer true for least squares problems and other problems involving rectangular matrices. Problems are identified which are arbitrarily ill-conditioned (in a componentwise sense) whereas any componentwise relative perturbation less than 1 cannot produce an ill-posed problem. Bounds are given using additional information on the matrix.
منابع مشابه
Stability Rates for Linear Ill-Posed Problems with Convolution and Multiplication Operators
In this paper we deal with thèstrength' of ill-posedness for ill-posed linear operator equations Ax = y in Hilbert spaces, where we distinguish according to M. Z. Nashed 15] the ill-posedness of type I if A is not compact, but we have R(A) 6 = R(A) for the range R(A) of A; and the ill-posedness of type II for compact operators A: From our considerations it seems to follow that the problems with...
متن کاملQuadratic Optimization in Ill-Posed Problems
Ill posed quadratic optimization frequently occurs in control and inverse problems and are not covered by the Lax-Milgram-Riesz theory. Typically small changes in the input data can produce very large oscillations on the output. We investigate the conditions under which the minimum value of the cost function is finite and we explore the ‘hidden connection’ between the optimization problem and t...
متن کاملLocal Differential Privacy for Physical Sensor Data and Sparse Recovery
In this work, we exploit the ill-posedness of linear inverse problems to design algorithms to release differentially private data or measurements of the physical system. We discuss the spectral requirements on a matrix such that only a small amount of noise is needed to achieve privacy and contrast this with the ill-conditionedness. We then instantiate our framework with several diffusion opera...
متن کاملIll-Conditioned Matrices Are Componentwise Near to Singularity
For a square matrix normed to 1, the normwise distance to singularity is well known to be equal to the reciprocal of the condition number. In this paper we give an elementary and selfcontained proof for the fact that an ill-conditioned matrix is also not far from a singular matrix in a componentwise sense. This is shown to be true for any weighting of the componentwise distance. In words: Ill-c...
متن کاملPreconditioning non-monotone gradient methods for retrieval of seismic reflection signals
The core problem in seismic exploration is to invert the subsurface reflectivity from the surface recorded seismic data. However, most of the seismic inverse problems are ill-posed by nature. To overcome the ill-posedness, different regularized least squares methods are introduced in the literature. In this paper, we developed a preconditioning non-monotone gradient method, proved it converges ...
متن کامل